Incidence coloring of graphs with high maximum average degree
نویسندگان
چکیده
An incidence of an undirected graph G is a pair (v, e) where v is a vertex of G and e an edge of G incident with v. Two incidences (v, e) and (w, f) are adjacent if one of the following holds: (i) v = w, (ii) e = f or (iii) vw = e or f . An incidence coloring of G assigns a color to each incidence of G in such a way that adjacent incidences get distinct colors. In 2005, Hosseini Dolama et al. [6] proved that every graph with maximum average degree strictly less than 3 can be incidence colored with ∆+ 3 colors. Recently, Bonamy et al. [2] proved that every graph with maximum degree at least 4 and with maximum average degree strictly less than 7 3 admits an incidence (∆+1)-coloring. In this paper we give bounds for the number of colors needed to color graphs having maximum average degrees bounded by different values between 4 and 6. In particular we prove that every graph with maximum degree at least 7 and with maximum average degree less than 4 admits an incidence (∆+3)-coloring. This result implies that every triangle-free planar graph with maximum degree at least 7 is incidence (∆ + 3)-colorable. We also prove that every graph with maximum average degree less than 6 admits an incidence (∆ + 7)-coloring. More generally, we prove that ∆+ k − 1 colors are enough when the maximum average degree is less than k and the maximum degree is sufficiently large.
منابع مشابه
k-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کامل-λ coloring of graphs and Conjecture Δ ^ 2
For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...
متن کاملList coloring the square of sparse graphs with large degree
We consider the problem of coloring the squares of graphs of bounded maximum average degree, that is, the problem of coloring the vertices while ensuring that two vertices that are adjacent or have a common neighbour receive different colors. Borodin et al. proved in 2004 and 2008 that the squares of planar graphs of girth at least seven and sufficiently large maximum degree ∆ are list (∆ + 1)-...
متن کاملRandomly coloring sparse random graphs with fewer colors than the maximum degree
We analyze Markov chains for generating a random k-coloring of a random graph Gn,d/n. When the average degree d is constant, a random graph has maximum degree log n/ log log n, with high probability. We efficiently generate a random k-coloring when k = Ω(log log n/ log log log n), i.e., with many fewer colors than the maximum degree. Previous results hold for a more general class of graphs, but...
متن کاملOn incidence coloring for some cubic graphs
In 1993, Brualdi and Massey conjectured that every graph can be incidence colored with ∆+2 colors, where ∆ is the maximum degree of a graph. Although this conjecture was solved in the negative by an example in [1], it might hold for some special classes of graphs. In this paper, we consider graphs with maximum degree ∆ = 3 and show that the conjecture holds for cubic Hamiltonian graphs and some...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 227 شماره
صفحات -
تاریخ انتشار 2017